Achieving proportional delay differentiation efficiently

In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model first proposed under the DiffServ framework [IEEE Network (1999)]. PDD can be achieved using a few algorithms, one of the most well-known being Waiting Time Priority(WTP). Using WTP [Proc. ACM SIGCOMM (1999)] as a reference, we show that our proposed Scaled Time Priority (STP) algorithm is able to provide near proportional delay at a complexity of Oð1Þ; which is lower than the OðNÞ complexity of WTP, where N is the number of service classes in the system. Simulation results also show that STP is able to emulate the performance of WTP. q 2003 Published by Elsevier B.V.